منابع مشابه
On the bit-complexity of sparse polynomial and series multiplication
In this paper we present various algorithms for multiplying multivariate polynomials and series. All algorithms have been implemented in the C++ libraries of the Mathemagix system. We describe naive and softly optimal variants for various types of coefficients and supports and compare their relative performances. For the first time we are able to observe the benefit of non naive arithmetic for ...
متن کاملFormal power series arising from multiplication of quantum integers
For the quantum integer [n]q = 1+q+q + · · ·+q there is a natural polynomial multiplication such that [mn]q = [m]q ⊗q [n]q . This multiplication is described by the functional equation fmn(q) = fm(q)fn(q ), defined on a given sequence F = {fn(q)} ∞ n=1 of polynomials such that fn(0) = 1 for all n. If F = {fn(q)} ∞ n=1 is a solution of the functional equation, then there exists a formal power se...
متن کاملBinary Theta Series and Modular Forms with Complex Multiplication
Let D be a negative discriminant, and let Θ(D) be the complex vector space generated by the binary theta series θf attached to the positive definite binary quadratic forms f(x, y) = ax + bxy + cy whose discriminant D(f) = b − 4ac equals D/t, for some integer t. It is a well-known classical fact that Θ(D) is a subspace of the space M1(|D|, ψD) of modular forms of weight 1, level |D| and Nebentyp...
متن کاملFast Multivariate Power Series Multiplication in Characteristic Zero
Let k be a field of characteristic zero. We present a fast algorithm for multiplying multivariate power series over k truncated in total degree. Up to logarithmic factors, its complexity is optimal, i.e. linear in the number of coefficients of the series.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1892
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1892-00068-7